Recurrence Function on Sturmian Words: A Probabilistic Study
نویسندگان
چکیده
This paper is a first attempt to describe the probabilistic behaviour of a random Sturmian word. It performs the probabilistic analysis of the recurrence function which provides precise information on the structure of such a word. With each Sturmian word of slope α, we associate particular sequences of factor lengths which have a given “position” with respect to the sequence of continuants of α, we then let α to be uniformly drawn inside the unit interval [0, 1]. This probabilistic model is well-adapted to better understand the role of the position in the recurrence properties.
منابع مشابه
The recurrence function of a random Sturmian word
This paper describes the probabilistic behaviour of a random Sturmian word. It performs the probabilistic analysis of the recurrence function which can be viewed as a waiting time to discover all the factors of length n of the Sturmian word. This parameter is central to combinatorics of words. Having fixed a possible length n for the factors, we let α to be drawn uniformly from the unit interva...
متن کاملRelation between powers of factors and recurrence function characterizing Sturmian words
In this paper we put into relation the index of an infinite aperiodic word and its recurrence function. With the use of this relation, we then give a new characterization of Sturmian words. As a byproduct, we give a new proof of theorem of Damanik and Lenz describing the index of a Sturmian word in terms of the continued fraction expansion of its slope.
متن کاملRelation between powers of factors and the recurrence function characterizing Sturmian words
In this paper we put into relation the index of an infinite aperiodic word and its recurrence function. With the use of this relation, we then give a new characterization of Sturmian words. As a byproduct, we give a new proof of theorem of Damanik and Lenz describing the index of a Sturmian word in terms of the continued fraction expansion of its slope.
متن کاملThe Number of Runs in Sturmian Words
Denote by S the class of standard Sturmian words. It is a class of highly compressible words extensively studied in combinatorics of words, including the well known Fibonacci words. The suffix automata for these words have a very particular structure. This implies a simple characterization (described in the paper by the Structural Lemma) of the periods of runs (maximal repetitions) in Sturmian ...
متن کاملRandom generation of finite Sturmian words
We present a bijection between the set of factors of given length of Sturmian words and some set of triples of nonnegative integers. This bijection and its inverse are both computable in linear time. Its applications are: a bijective proof of Mignosi's formula for counting Sturmian words, a linear probabilistic algorithm for generating finite Sturmian word at random, and, using similar techniqu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015